Polynomial Size Analysis of First-Order Shapely Functions
نویسندگان
چکیده
منابع مشابه
Polynomial Size Analysis of First-Order Shapely Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be implementations of matrix multiplication and the Cartesian product of two lists. The type system is proved to be sound w.r.t...
متن کاملPolynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be matrix multiplication and the Cartesian product of two lists. The type checking problem for the type system is shown to be u...
متن کاملar X iv : 0 90 2 . 20 73 v 1 [ cs . L O ] 1 2 Fe b 20 09 POLYNOMIAL SIZE ANALYSIS OF FIRST - ORDER SHAPELY FUNCTIONS
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be implementations of matrix multiplication and the Cartesian product of two lists. The type system is proved to be sound w.r.t...
متن کاملType Checking and Weak Type Inference for Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely functions. Here, a function is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely functions are matrix multiplication and the Cartesian product of two lists. The type checking problem for the type system is shown to be undecidable in general. We define a n...
متن کاملChapter 12 FIRST - ORDER POLYNOMIAL
This chapter focuses on rst-order polynomial based theorem proving. We present the notion of well-behaved inference rules and two concrete such inference rules termed superposition I and superposition II. The SOS-strategy and the L-strategy for well-behaved inference rules are developed, and both of them are proved to be complete. We introduce the LM-strategy, the connuent LM-strategy, the MM-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2009
ISSN: 1860-5974
DOI: 10.2168/lmcs-5(2:10)2009